Computing the jump number on semi-orders is polynomial
نویسندگان
چکیده
منابع مشابه
Computing the Jump Number on Semi-orders Is Polynomial
1) Introduction and notations In this first section we will give our main definitions and recall different characterizations of interval and semi-orders. In section 2 we shall prove that after a decomposition routine, semi-orders have at most 2 consecutive bumps in a linear extension. We also prove, using a "divide-and-conquer" argument, that computing polynomially the jump number can be done p...
متن کاملThe database of interval orders difficult for the jump number minimizing algorithms
The problems of scheduling jobs on a single machine subject to precedence constraints can often be modelled as the jump number problem for posets, where a linear extension of a given partial order is to be found which minimizes the number of noncomparabilities. In this paper, we are investigating a restricted class of posets, called interval orders, admitting approximation algorithms for the ju...
متن کاملPolynomial Path Orders
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP, that is applicable in two related, but distinct contexts. On the one hand POP induces polynomial innermost runtime complexity and hence may serve as a syntactic, and full...
متن کاملA 3/2-Approximation Algorithm for the Jump Number of Interval Orders
The jump number of a partial order P is the minimum number of incomparable adjacent pairs in some linear extension of P. The jump number problem is known to be NP {hard in general. However some particular classes of posets admit easy calculation of the jump number. The complexity status for interval orders still remains unknown. Here we present a heuristic that, given an interval order P , gene...
متن کاملThe Number of Finite Groups Whose Element Orders is Given
The spectrum ω(G) of a finite group G is the set of element orders of G. If Ω is a non-empty subset of the set of natural numbers, h(Ω) stands for the number of isomorphism classes of finite groups G with ω(G) = Ω and put h(G) = h(ω(G)). We say that G is recognizable (by spectrum ω(G)) if h(G) = 1. The group G is almost recognizable (resp. nonrecognizable) if 1 < h(G) < ∞ (resp. h(G) = ∞). In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90111-2